A Many-Objective Evolutionary Algorithm Based on Indicator and Decomposition

نویسندگان

چکیده

In the field of many-objective evolutionary optimization algorithms (MaOEAs), how to maintain balance between convergence and diversity has been a significant research problem. With increase number objectives, mutually nondominated solutions increases rapidly, multi-objective algorithms, based on Pareto-dominated relations, become invalid because loss selection pressure in environmental selection. order solve this problem, indicator-based have proposed; however, they are not good enough at maintaining diversity. Decomposition-based methods achieved promising performance keeping paper, we propose MaOEA indicator decomposition (IDEA) keep simultaneously. Moreover, decomposition-based do work well irregular PFs. To tackle paper develops reference-points adjustment method learning population. Experimental studies several well-known benchmark problems show that IDEA is very effective compared ten state-of-the-art algorithms.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

IGD Indicator-based Evolutionary Algorithm for Many-objective Optimization Problems

Inverted Generational Distance (IGD) has been widely considered as a reliable performance indicator to concurrently quantify the convergence and diversity of multiand manyobjective evolutionary algorithms. In this paper, an IGD indicatorbased evolutionary algorithm for solving many-objective optimization problems (MaOPs) has been proposed. Specifically, the IGD indicator is employed in each gen...

متن کامل

A new uniform evolutionary algorithm based on decomposition and CDAS for many-objective optimization

The convergence and the diversity are two main goals of an evolutionary algorithm for many-objective optimization problems. However, achieving these two goals simultaneously is the difficult and challenging work for multi-objective evolutionary algorithms. A uniform evolutionary algorithm based on decomposition and the control of dominance area of solutions (CDAS) is proposed to achieve these t...

متن کامل

Evolutionary Many-Objective Optimization Based on Adversarial Decomposition

The decomposition-based method has been recognized as a major approach for multiobjective optimization. It decomposes a multi-objective optimization problem into several singleobjective optimization subproblems, each of which is usually defined as a scalarizing function using a weight vector. Due to the characteristics of the contour line of a particular scalarizing function, the performance of...

متن کامل

A Decomposition Based Evolutionary Algorithm for Many Objective Optimization with Systematic Sampling and Adaptive Epsilon Control

• Many objective optimization typically refers to problems with the number of objectives greater than four. • The commonly used dominance based methods for multi-objective optimization, such as NSGA-II, SPEA2 etc. are known to be inefficient for many-objective optimization as non-dominance does not provide adequate selection pressure to drive the population towards convergence. • There are also...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2023

ISSN: ['2227-7390']

DOI: https://doi.org/10.3390/math11020413